Fine-Grain Adaptive Scheduling using Feedback

نویسندگان

  • Henry Massalin
  • Calton Pu
چکیده

We describe an implementation of a fine-grain adaptive scheduling mechanism, based on software feedback. Conventional scheduling makes job assignment exclusively a function of time. We broaden the meaning of the term "scheduling" to include job assignment as a function of a sequence of events, such as timer interrupts, I/O operations, queue overflodunderflow, and system call traps. Our implementation of software feedback in the Synthesis operating system is analogous to the hardware phase locked loop. Very low overhead context switches and scheduling cost (a few microseconds on a 68020-based machine) makes this implementation useful to practical applications such as digital signal processing. Since scheduling actions and policy adjustments occur at very frne granularity (sub-millisecond intervals), Synthesis adaptive scheduling is very sensitive. Interesting applications of fine-grain adaptive scheduling include I/O device management, real-time scheduling, and distributed adaptive scheduling. @ Computing Systems, Vol. 3'No. I 'Winter 1990 L39

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feedback - Based Scheduling : a Toolbox

1 Background and Introduction Fine-grain scheduling based on software feedback 3] was introduced in the Synthesis operating system 4, 2] to solve two problems: the dependency between jobs in a pipeline and the low-latency requirements of multimedia type applications. The performance level achieved and the adaptive-ness of applications running on Synthesis demonstrated the success of ne-grain sc...

متن کامل

Investigating Parallel Genetic Algorithms on Job Shop Scheduling Problems

This paper describes a GA for job shop scheduling problems. Using the Giffler and Thompson algorithm, we created two new operators, THX crossover and mutation, which better transmit temporal relationships in the schedule. The approach produced excellent results on standard benchmark job shop scheduling problems. We further tested many models and scales of parallel GAs in the context of job shop...

متن کامل

Fine-grain Period Adaptation in Soft Real-Time Environments

Reservation-based scheduling delivers a proportion of the CPU to jobs over a period of time. In this paper we argue that automatically determining and assigning this period is both possible and useful in general purpose soft real-time environments such as personal computers and information appliances. The goal of period adaptation is to select the period over which a job is guaranteed to receiv...

متن کامل

Comparison of Context Switching Methods for Fine Grain Process Scheduling

Context switching times are a major source of overhead in medium to fine grain process scheduling. We compared three different context switching techniques for non-preemptive scheduling in context of hardware/software codesign, and found major differences in performance and code size efficiency.

متن کامل

Near fine grain parallel processing using a multiprocessor with MAPLE

Multi-grain parallelizing scheme is one of effective parallelizing schemes which exploits various level parallelism: coarse-grain(macro-dataflow), medium-grain(loop level parallelizing) and near-fine-grain(statements parallelizing) from a sequential program. A multi-processor ASCA is designed for efficient execution of multi-grain parallelizing program. A processing element called MAPLE are mai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computing Systems

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1989